Formulations and Heuristics for Minimal Spanning Trees with Minimum Degree Constraints
نویسندگان
چکیده
Let G = (V, E) be a connected undirected graph, where V = {1, . . . , n} is the set of nodes and E the set of edges. Consider that there are associated positive costs, ce, to each edge e ∈ E. Given a positive integer valued function d : V → N on the nodes, the Min-Degree Constrained Minimum Spanning Tree (md-MST) problem consists in finding a spanning tree T of G with minimum total edge cost, given by ∑
منابع مشابه
Optimal Self-healing of Smart Distribution Grids Based on Spanning Trees to Improve System Reliability
In this paper, a self-healing approach for smart distribution network is presented based on Graph theory and cut sets. In the proposed Graph theory based approach, the upstream grid and all the existing microgrids are modeled as a common node after fault occurrence. Thereafter, the maneuvering lines which are in the cut sets are selected as the recovery path for alternatives networks by making ...
متن کاملBottleneck Distances and Steiner Trees in the Euclidean d-Space
Some of the most efficient heuristics for the Euclidean Steiner minimal trees in the d-dimensional space, d ≥ 2, use Delaunay tessellations and minimum spanning trees to determine small subsets of geometrically close terminals. Their low-cost Steiner trees are determined and concatenated in a greedy fashion to obtain low cost trees spanning all terminals. The weakness of this approach is that o...
متن کاملMinimal spanning trees with a constraint on the number of leaves
In this paper we discuss minimal spanning trees with a constraint on the number of leaves. Tree topologies appear when designing centralized terminal networks. The constraint on the number of leaves arises because the software and hardware associated to each terminal differs accordingly with its position in the tree. Usually, the software and hardware associated to a "degree-l" terminal is chea...
متن کاملNetwork design through forests with degree- and role-constrained minimum spanning trees
Finding the degree-constrained minimum spanning tree (DCMST) of a graph is a widely studied NP-hard problem. One of its most important applications is network design. Here we deal with a new variant of the DCMST problem, which consists of finding not only the degreebut also the roleconstrained minimum spanning tree (DRCMST), i.e., we add constraints to restrict the role of the nodes in the tree...
متن کاملDegree sums and dense spanning trees
Finding dense spanning trees (DST) in unweighted graphs is a variation of the well studied minimum spanning tree problem (MST). We utilize established mathematical properties of extremal structures with the minimum sum of distances between vertices to formulate some general conditions on the sum of vertex degrees. We analyze the performance of various combinations of these degree sum conditions...
متن کامل